Integrability of trigonometric series with generalized semi-convex coefficients
نویسندگان
چکیده
منابع مشابه
Integrability and L- Convergence of Rees-stanojević Sums with Generalized Semi-convex Coefficients of Non-integral Orders
be the Fourier cosine series. The problem of L-convergence of the Fourier cosine series (1.1) has been settled for various special classes of coefficients. Young [9] found that an logn = o(1), n → ∞ is a necessary and sufficient condition for the L-convergence of the cosine series with convex (△an ≥ 0) coefficients, and Kolmogorov [8] extended this result to the cosine series with quasi-convex ( ∞
متن کاملTrigonometric series with a generalized monotonicity condition
Abstract In this paper, we consider numerical and trigonometric series with a very general monotonicity condition. First, a fundamental decomposition is established from which the sufficient parts of many classical results in Fourier analysis can be derived in this general setting. In the second part of the paper a necessary and sufficient condition for the uniform convergence of sine series is...
متن کاملOn Integrability of Functions Defined by Trigonometric Series
The goal of the present paper is to generalize two theorems of R.P. Boas Jr. pertaining to L (p > 1) integrability of Fourier series with nonnegative coefficients and weight x . In our improvement the weight x is replaced by a more general one, and the case p = 1 is also yielded. We also generalize an equivalence statement of Boas utilizing power-monotone sequences instead of {n}.
متن کاملPower-monotone Sequences and Integrability of Trigonometric Series
The theorem proved in this paper is a generalization of some results, concerning integrability of trigonometric series, due to R.P. Boas, L. Leindler, etc. This result can be considered as an example showing the utility of the notion of power-monotone sequences.
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Opuscula Mathematica
سال: 2012
ISSN: 1232-9274
DOI: 10.7494/opmath.2012.32.3.521